Perturbed Adaptive Belief Propagation Decoding for High-Density Parity-Check Codes

Reduced complexity iterative decoding of low-density parity check codes based on belief propagation

In this paper, two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two al...

Iterative Decoding beyond Belief Propagation of Low-density Parity-check Codes

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14

Early Decision Decoding Methods for Low-Density Parity-Check Codes

Low-density parity-check codes have recently received extensive attention as a forward error correction scheme in a wide area of applications. The decoding algorithm is inherently parallelizable, allowing communication at high speeds. One of the main disadvantages, however, is large memory requirements for interim storing of decoding data. In this paper, we investigate a modification to the dec...

Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks

Iterative Decoding of Low-Density Parity Check Codes (A Survey)

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely effici...